On enumerating chordless circuits in directed graphs
نویسنده
چکیده
We introduce and discuss an algorithm using O(p) time and O(n(n + m)) space for enumerating the m > 0 chordless circuits in a digraph of order n and containing p chordless paths. Running it on random digraphs yields some statistical insight into its practical performance.
منابع مشابه
A GPU-based parallel algorithm for enumerating all chordless cycles in graphs
Finding chordless cycles is an important theoretical problem in the Graph Theory area. It also can be applied to practical problems such as discover which predators compete for the same food in ecological networks. Motivated by the problem of theoretical interest and also by its significant practical importance, we present in this paper a parallel algorithm for enumerating all the chordless cyc...
متن کاملAn Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths
A chordless cycle (induced cycle) C of a graph is a cycle without any chord, meaning that there is no edge outside the cycle connecting two vertices of the cycle. A chordless path is defined similarly. In this paper, we consider the problems of enumerating chordless cycles/paths of a given graph G = (V,E), and propose algorithms taking O(|E|) time for each chordless cycle/path. In the existing ...
متن کاملGraph Algorithms for Constructing and Enumerating Cycles and Related Structures
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Ville Pettersson Name of the doctoral dissertation Graph Algorithms for Constructing and Enumerating Cycles and Related Structures Publisher School of Electrical Engineering Unit Department of Communications and Networking Series Aalto University publication series DOCTORAL DISSERTATIONS 127/2015 Field of research Information ...
متن کاملEnumerating Circuits and Loops in Graphs with Self-Arcs and Multiple-Arcs
The problems of detecting and enumerating circuits in graphs and networks are still of fundamental importance. We extend the circuit enumeration algorithm of Johnson for graphs with directed-arcs, multiple-arcs and self-arcs and present a memory efficient and high-performance implementation in the D programming language. We also discuss other circuit applications including how the code could be...
متن کاملChordal Digraphs
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed graphs. Several structural properties of chordal graphs that are crucial for algorithmic applications carry over to the directed setting, including notions like simplicial vertices, perfect elimination orderings, and ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009